Algorithms for Dempster-Shafer Theory
نویسنده
چکیده
The method of reasoning with uncertain information known as Dempster-Shafer theory arose from the reinterpretation and development of work of Arthur Dempster [Dempster, 67; 68] by Glenn Shafer in his book a mathematical theory of evidence [Shafer, 76], and further publications e.g., [Shafer, 81; 90]. More recent variants of Dempster-Shafer theory include the Transferable Belief Model see e.g., [Smets, 88; Smets and Kennes, 94] and the Theory of Hints e.g., [Kohlas and Monney, 95]. Use of the method involves collecting a number of pieces of uncertain information, which are judged to be ‘independent’. Each individual piece of information is represented within the formalism as what is known as a mass function, these are combined using Dempster’s rule, and the degrees of belief for various propositions of interest are then calculated. Propositions are expressed as subsets of a set of possibilities, known as the frame of discernment. Two major problems with the theory are (i) understanding what the calculated values of belief mean; this issue is briefly discussed in section 2.5; and (ii) the computational problems of Dempster’s rule, to which most of this chapter is addressed. The obvious algorithm for calculating the effect of Dempster’s rule, as sketched in [Shafer, 76], is (at worst) exponential and [Orponen, 90] has shown that the problem is #P-complete. However Monte-Carlo methods can be used to approximate very closely a value of combined belief, and these have much better complexity: some methods have complexity almost linearly related to the size of the frame, but with a high constant factor because of having to use a large number of trials in order to ensure that the approximation is a good one. In many applications the frame of discernment is expressed in terms of a product set generated by the values of a number of variables (see section 9), so the size of the frame is itself exponential in the number of variables. Glenn Shafer and Prakash Shenoy have devised techniques for this situation. The exact
منابع مشابه
A Study on Properties of Dempster-Shafer Theory to Probability Theory transformations
In this paper, five conditions that have been proposed by Cobb and Shenoy are studied for nine different mappings from the Dempster-Shafer theory to the probability theory. After comparing these mappings, one of the considerable results indicates that none of the mappings satisfies the condition of invariance with respect to the marginalization process. In more details, the main reason for this...
متن کاملA NEW FUZZY MORPHOLOGY APPROACH BASED ON THE FUZZY-VALUED GENERALIZED DEMPSTER-SHAFER THEORY
In this paper, a new Fuzzy Morphology (FM) based on the GeneralizedDempster-Shafer Theory (GDST) is proposed. At first, in order to clarify the similarity ofdefinitions between Mathematical Morphology (MM) and Dempster-Shafer Theory (DST),dilation and erosion morphological operations are studied from a different viewpoint. Then,based on this similarity, a FM based on the GDST is proposed. Unlik...
متن کاملمحاسبه فاصله عدم قطعیت بر پایه آنتروپی شانون و تئوری دمپستر-شافر از شواهد
Abstract Dempster Shafer theory is the most important method of reviewing uncertainty for information system. This theory as introduced by Dempster using the concept of upper and lower probabilities extended later by Shafer. Another important application of entropy as a basic concept in the information theory can be used as a uncertainty measurement of the system in specific situation In th...
متن کاملREGION MERGING STRATEGY FOR BRAIN MRI SEGMENTATION USING DEMPSTER-SHAFER THEORY
Detection of brain tissues using magnetic resonance imaging (MRI) is an active and challenging research area in computational neuroscience. Brain MRI artifacts lead to an uncertainty in pixel values. Therefore, brain MRI segmentation is a complicated concern which is tackled by a novel data fusion approach. The proposed algorithm has two main steps. In the first step the brain MRI is divided to...
متن کاملA Sensor-Based Scheme for Activity Recognition in Smart Homes using Dempster-Shafer Theory of Evidence
This paper proposes a scheme for activity recognition in sensor based smart homes using Dempster-Shafer theory of evidence. In this work, opinion owners and their belief masses are constructed from sensors and employed in a single-layered inference architecture. The belief masses are calculated using beta probability distribution function. The frames of opinion owners are derived automatically ...
متن کاملDistance function of D numbers
Dempster-Shafer theory is widely applied in uncertainty modelling and knowledge reasoning due to its ability of expressing uncertain information. A distance between two basic probability assignments(BPAs) presents a measure of performance for identification algorithms based on the evidential theory of Dempster-Shafer. However, some conditions lead to limitations in practical application for Dem...
متن کامل